On projectional skeletons in Vašák spaces
نویسندگان
چکیده
منابع مشابه
Banach spaces with projectional skeletons ?
A projectional skeleton in a Banach space is a σ-directed family of projections onto separable subspaces, covering the entire space. The class of Banach spaces with projectional skeletons is strictly larger than the class of Plichko spaces (i.e. Banach spaces with a countably norming Markushevich basis). We show that every space with a projectional skeleton has a projectional resolution of the ...
متن کاملMultilevel Characterizations of Function Spaces on Skeletons
Function spaces on skeletons arise in the numerical treatment of elliptic boundary value problems by certain domain decomposition methods. In this note, we discuss such function spaces, which can be interpreted as trace spaces. We construct a well{deened trace operator and present a characterization of the trace spaces by means of multi-level expansions.
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولTowards User-Friendly Projectional Editors
Today’s challenges for language development include language extension and composition, as well as the use of diverse notations. A promising approach is projectional editing, a technique to directly manipulate the abstract syntax tree of a program, without relying on parsers. Its potential lies in the ability to combine diverse notational styles – such as text, symbols, tables, and graphics – a...
متن کاملOn Herbrand Skeletons
Herbrand's theorem plays an important role both in proof theory and in computer science. Given a Herbrand skeleton, which is basically a number specifying the count of disjunctions of the matrix, we would like to get a computable bound on the size of terms which make the disjunction into a quasitautology. This is an important problem in logic, speciically in the complexity of proofs. In compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Commentationes Mathematicae Universitatis Carolinae
سال: 2017
ISSN: 0010-2628,1213-7243
DOI: 10.14712/1213-7243.2015.200